Load Balancing for Minimizing Execution Time of a Target Job on a Network of Heterogeneous Workstations
نویسندگان
چکیده
A network of workstations (NOWs) may be employed for high performance computing where execution time of a target job is to be minimized. Job arrival rate and size are “random” on a NOWs. In such an environment, partitioning (load balancing) a target job based on only the first order moments (means) of system parameters is not optimal. In this paper, it is proposed to consider the second order moments (standard deviations) also in load balancing in order to minimize execution time of a target job on a set of workstations where the round-robin job scheduling policy is adopted. It has been verified through computer simulation that the proposed static and dynamic load balancing schemes can significantly reduce execution time of a target job in a NOWs environment, compared to cases where only the means of the parameters are used.
منابع مشابه
Hierarchical Partitioning and Dynamic Load Balancing for Scientific Computation
Cluster and grid computing has made hierarchical and heterogeneous computing systems increasingly common as target environments for large-scale scientific computation. A cluster may consist of a network of multiprocessors. A grid computation may involve communication across slow interfaces. Modern supercomputers are often large clusters with hierarchical network structures. For maximum efficien...
متن کاملMARS - A framework for minimizing the job execution time in a metacomputing environment
Utilizing a collection of workstations and supercomputers in a metacomputing environment does not only o er an enormous amount of computing power, but also raises new problems. The true potential of WAN-based distributed computing can only be exploited if the application-to-architecture mapping re ects the di erent processor speeds, network performances and the application's communication chara...
متن کاملCustomized Dynamic Load Balancing for a Network of Workstations
Load balancing involves assigning to each processor work proportional to its performance, thereby minimizing the execution time of a program. Although static load balancing can solve many problems (e.g., those caused by processor heterogeneity and nonuniform loops) for most regular applications, the transient external load due to multiple users on a network of workstations necessitates a dynami...
متن کاملPerformance Evaluation of Static and Dynamic Load Balancing Schemes for a Parallel Computational Fluid Dynamics Software (CFD) Application (FLUENT) Distributed across Clusters of Heterogeneous Symmetric Multiprocessor Systems
Computational Fluid Dynamics (CFD) applications are “highly parallelizable” and can be distributed across a cluster of computers. However, because computation time can vary with the distributed part (mesh), the system loads are unpredictable and processors can have widely different computation speeds. Load balancing (and thus computational efficiency) across a heterogeneous cluster of processor...
متن کاملDecentralized Probabilistic Job Dispatching in Heterogeneous Multiple Computer Systems
In this paper, we study decentralized probabilistic job dispatching and load balancing strategies which optimize the performance of heterogeneous multiple computer systems. We present a model to study a heterogeneous multiple computer system with a decentralized stochastic job dispatching mechanism, where nodes are treated as M/G/1 servers. We discuss a way to implement a virtual centralized jo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000